Intractability vs Worst
نویسنده
چکیده
We use the assumption that all sets in NP or other levels of the polynomial time hierarchy have e cient average case algorithms to derive collapse consequences for MA AM and various subclasses of P poly As a further consequence we show for C fP PP PSPACEg that C is not tractable in the average case unless C P
منابع مشابه
Average-Case Intractability vs. Worst-Case Intractability
We use the assumption that all sets in NP (or other levels of the polynomial-time hierarchy) have eecient average-case algorithms to derive collapse consequences for MA, AM, and various subclasses of P/poly. As a further consequence we show for C 2 fP(PP); PSPACEg that C is not tractable in the average-case unless C = P.
متن کاملAn intractability result for multiple integration
We prove that the problem of multiple integration in the Korobov class Eα,d is intractable since the number of function evaluations required to achieve a worst case error less than 1 is exponential in the dimension.
متن کاملA Decade of Lattice Cryptography
Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic constructions. Attractive features of lattice cryptography include: apparent resistance to quantum attacks (in contrast with most number-theoretic cryptography), high asymptotic efficiency and parallelism, security under worst-case intractability assumptions, and...
متن کاملUsing an Expressive Description Logic: FaCT or Fiction?
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description language is formally defined, so that the subsumption relationship between two concept descriptions can be computed by a suitable algorithm. Description Logics have proved useful in a range of applications but their wider ac...
متن کاملAn Average Case NP-Complete Graph Coloring Problem
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard on average unless all NP problem under all samplable (i.e., generatable in polynomial time) distributions ...
متن کامل